Termination w.r.t. Q of the following Term Rewriting System could be proven:
Q restricted rewrite system:
The TRS R consists of the following rules:
b(c(a(x1))) → a(b(a(b(c(x1)))))
b(x1) → c(c(x1))
c(d(x1)) → a(b(c(a(x1))))
a(a(x1)) → a(c(b(a(x1))))
Q is empty.
↳ QTRS
↳ RFCMatchBoundsTRSProof
Q restricted rewrite system:
The TRS R consists of the following rules:
b(c(a(x1))) → a(b(a(b(c(x1)))))
b(x1) → c(c(x1))
c(d(x1)) → a(b(c(a(x1))))
a(a(x1)) → a(c(b(a(x1))))
Q is empty.
Termination of the TRS R could be shown with a Match Bound [6,7] of 3. This implies Q-termination of R.
The following rules were used to construct the certificate:
b(c(a(x1))) → a(b(a(b(c(x1)))))
b(x1) → c(c(x1))
c(d(x1)) → a(b(c(a(x1))))
a(a(x1)) → a(c(b(a(x1))))
The certificate found is represented by the following graph.
The certificate consists of the following enumerated nodes:
1, 2, 4, 5, 3, 6, 7, 8, 9, 13, 12, 10, 11, 14, 15, 16, 17, 19, 20, 18, 21, 22, 23, 27, 26, 24, 25, 28, 29, 30, 31, 32, 33, 34, 38, 37, 35, 36, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49
Node 1 is start node and node 2 is final node.
Those nodes are connect through the following edges:
- 1 to 3 labelled a_1(0)
- 1 to 6 labelled a_1(0)
- 1 to 9 labelled c_1(0)
- 1 to 10 labelled a_1(0)
- 1 to 32 labelled a_1(1)
- 2 to 2 labelled #_1(0)
- 4 to 5 labelled c_1(0)
- 5 to 2 labelled a_1(0)
- 5 to 21 labelled a_1(1)
- 3 to 4 labelled b_1(0)
- 3 to 15 labelled c_1(1)
- 3 to 24 labelled a_1(1)
- 6 to 7 labelled c_1(0)
- 7 to 8 labelled b_1(0)
- 7 to 16 labelled c_1(1)
- 8 to 2 labelled a_1(0)
- 8 to 21 labelled a_1(1)
- 9 to 2 labelled c_1(0)
- 9 to 18 labelled a_1(1)
- 9 to 45 labelled a_1(2)
- 13 to 2 labelled c_1(0)
- 13 to 18 labelled a_1(1)
- 13 to 45 labelled a_1(2)
- 12 to 13 labelled b_1(0)
- 12 to 17 labelled c_1(1)
- 12 to 24 labelled a_1(1)
- 10 to 11 labelled b_1(0)
- 10 to 14 labelled c_1(1)
- 11 to 12 labelled a_1(0)
- 11 to 32 labelled a_1(1)
- 14 to 11 labelled c_1(1)
- 15 to 4 labelled c_1(1)
- 16 to 8 labelled c_1(1)
- 17 to 13 labelled c_1(1)
- 19 to 20 labelled c_1(1)
- 20 to 2 labelled a_1(1)
- 20 to 21 labelled a_1(1)
- 18 to 19 labelled b_1(1)
- 18 to 31 labelled c_1(2)
- 18 to 35 labelled a_1(2)
- 21 to 22 labelled c_1(1)
- 22 to 23 labelled b_1(1)
- 22 to 30 labelled c_1(2)
- 23 to 2 labelled a_1(1)
- 23 to 21 labelled a_1(1)
- 27 to 2 labelled c_1(1)
- 27 to 18 labelled a_1(1)
- 27 to 21 labelled c_1(1)
- 27 to 45 labelled a_1(2)
- 26 to 27 labelled b_1(1)
- 26 to 29 labelled c_1(2)
- 26 to 24 labelled a_1(1)
- 24 to 25 labelled b_1(1)
- 24 to 28 labelled c_1(2)
- 25 to 26 labelled a_1(1)
- 25 to 42 labelled a_1(2)
- 28 to 25 labelled c_1(2)
- 29 to 27 labelled c_1(2)
- 30 to 23 labelled c_1(2)
- 31 to 19 labelled c_1(2)
- 32 to 33 labelled c_1(1)
- 33 to 34 labelled b_1(1)
- 33 to 41 labelled c_1(2)
- 34 to 24 labelled a_1(1)
- 38 to 2 labelled c_1(2)
- 38 to 18 labelled a_1(1)
- 38 to 21 labelled c_1(2)
- 38 to 45 labelled a_1(2)
- 37 to 38 labelled b_1(2)
- 37 to 40 labelled c_1(3)
- 37 to 24 labelled a_1(1)
- 35 to 36 labelled b_1(2)
- 35 to 39 labelled c_1(3)
- 36 to 37 labelled a_1(2)
- 36 to 42 labelled a_1(2)
- 39 to 36 labelled c_1(3)
- 40 to 38 labelled c_1(3)
- 41 to 34 labelled c_1(2)
- 42 to 43 labelled c_1(2)
- 43 to 44 labelled b_1(2)
- 43 to 49 labelled c_1(3)
- 44 to 24 labelled a_1(2)
- 45 to 46 labelled c_1(2)
- 46 to 47 labelled b_1(2)
- 46 to 48 labelled c_1(3)
- 47 to 35 labelled a_1(2)
- 48 to 47 labelled c_1(3)
- 49 to 44 labelled c_1(3)